Partitioning Friends Fairly

We consider the problem of partitioning n agents in an undirected social network into k almost equal size (differing by at most one) groups, where utility agent for a group is number her neighbors group. The core and envy-freeness are two compelling axiomatic fairness guarantees such settings. former demands that there be no coalition each has more than own group, while latter envy another they in. provide (often tight) approximations to both guarantees, many our positive results obtained via efficient algorithms.